# 给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。
# 你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。
# 给定 nums = [2, 7, 11, 15], target = 9
# 因为 nums[0] + nums[1] = 2 + 7 = 9
# 所以返回 [0, 1]
import time


def twoSum(nums, target):
    for i in enumerate(nums):
        for j in enumerate(nums):
            if i[1] + j[1] == target and i[0] != j[0]:
                return [i[0], j[0]]


def hash_two_sum(nums, target):
    hash_map = {}
    for i in enumerate(nums):
        another_i = target - i[1]
        if another_i in hash_map:
            return [hash_map[another_i], i[0]]
        else:
            hash_map[i[1]] = i[0]


test_list = [i for i in range(100000)]
now = time.time()
print(twoSum(test_list, 151561))
print(time.time() - now)
now = time.time()
print(hash_two_sum(test_list, 151561))
print(time.time() - now)
